Semantics and Logic of Object Calculi
نویسندگان
چکیده
The main contribution of this paper is a formal characterization of recursive object specifications and their existence based on a denotational untyped semantics of the object calculus. Existence is not guaranteed but can be shown employing Pitts’ results on relational properties of domains. The semantics can be used to analyse and verify Abadi & Leino’s object logic but it also suggests extensions. For example, specifications of methods may not only refer to fields but also to methods of objects in the store. This can be achieved without compromising the existence theorem. An informal logic of predomains is in use intentionally in order to avoid any commitment to a particular syntax of specification logic.
منابع مشابه
Declarative Semantics in Object-Oriented Software Development - A Taxonomy and Survey
One of the modern paradigms to develop an application is object oriented analysis and design. In this paradigm, there are several objects and each object plays some specific roles in applications. In an application, we must distinguish between procedural semantics and declarative semantics for their implementation in a specific programming language. For the procedural semantics, we can write a ...
متن کاملA π – calculus Semantics of Logical Variables and Unification
A π–calculus semantics of terms and logical variables, environment creation visavis term copying and variable refreshing, and sequential unification is presented. The π–calculus’s object–oriented approach to modelling evolving communication structures is used to model the evolving communication environment found in concurrent logic program computations. The novelty of this semantics is that it ...
متن کاملA {calculus Semantics of Logical Variables and Uniication
A {calculus semantics of terms and logical variables, environment creation visavis term copying and variable refreshing, and sequential uniication is presented. The {calculus's object{oriented approach to modelling evolving communication structures is used to model the evolving communication environment found in concurrent logic program computations. The novelty of this semantics is that it exp...
متن کاملLabelled Tableau Calculi for Weak Modal Logics
Many normal and regular modal logics have simple formalizations in terms of labelled tableaux (cf. [3], [4]). But these modal logics have direct characterisation in terms of Kripke frames, and labels are naturally modelled on this kind of semantics. It is an interesting question whether this well known method can be extended to some congruent and monotonic modal logics, which are not characteri...
متن کاملOn the relation between coherence semantics and multiplicative proof nets
It is known that (mix) proof nets admit a coherence semantics, computed as a set of experiments. We prove here the converse: a proof structure is shown to be a proof net whenever its set of experiments is a semantical object — a clique of the corresponding coherence space. Moreover the interpretation of atomic formulae can be restricted to a given coherent space with four tokens in its web. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 316 شماره
صفحات -
تاریخ انتشار 2002